翻訳と辞書 |
Open coloring axiom : ウィキペディア英語版 | Open coloring axiom In mathematical set theory, the open coloring axiom (abbreviated OCA) is an axiom about coloring edges of a graph whose vertices are a subset of the real numbers: two different versions were introduced by and by . The open coloring axiom follows from the proper forcing axiom. ==Statement==
Suppose that ''X'' is a subset of the reals, and each pair of elements of ''X'' is colored either black or white, with set of white pairs being open. The open coloring axiom states that either ''X'' has an uncountable subset such that any pair from this subset is white, or ''X'' can be partitioned into a countable number of subsets such that any pair from the same subset is black.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Open coloring axiom」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|